Dynamic Distributed BackJumping
نویسندگان
چکیده
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed version of the centralized BackJumping algorithm, called the Dynamic Distributed BackJumping DDBJ algorithm. The advantage is twofold: DDBJ inherits the strength of synchronous algorithms that enables it to easily combine with a powerful dynamic ordering of variables and values, and still it maintains some level of autonomy for the agents. Experimental results show that DDBJ outperforms the DiDB and AFC algorithms by a factor of one to two orders of magnitude on hard instances of randomly generated
منابع مشابه
Concurrent search for distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search processes (SPs) that operate concurrently and scan non-intersecting parts of the global search space. Each SP is represented by a unique data structure, containing a current partial assignment (CPA), that is circulated am...
متن کاملCooperative Dynamic Multi-CBJ Search for DisCSPs
A multi search process version of the sequential assignment, distributed Conflict based BackJumping algorithm is presented. Multi-CBJ benefits greatly from sharing of Nogoods among search processes. It also improves when the multi-search process is dynamic, generating CBJ processes during search with a dynamic heuristic that controls load balancing. The resulting algorithm, Cooperative Dynamic ...
متن کاملEvaluating Backjumping for Disjunctive Logic Programming Valutazione del Backjumping per Programmazione Logica Disgiuntiva
SOMMARIO/ABSTRACT In questo articolo presentiamo la tecnica del backjump-ing per la Programmazione Logica Disgiuntiva, prendendo spunto dai lavori svolti per solutori per Constraint e log-ica proposizionale. A differenza dei lavori citati, ci fo-calizzaremo su backjumping senza (clause) learning. Pre-senteremo un fondamento teorico per questa tecnica sfrut-tando le peculiarità della logica su c...
متن کاملConflicting Agents in Distributed Search
We extend here the work on interleaved distributed graph based backjumping, IDIBT/GBJ 7,6,5 by considering conflicting agents . The resulting method IDIBT/CBJ-DkC for Conflict-directed BackJumbing and Directed k-Consistency combines distributed and parallel explorations of search spaces with more efficient backtrack steps. We take advantage of the asynchronous framework to implement a more refi...
متن کاملAsynchronous Forward Bounding for Distributed COPs
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and compute bounds on partial assignments asynchronously. The asynchronous bounds computation is based on the propagation of partial assignments. The asynchronous forward-bounding algorithm (AFB) is a distributed optimization search algorithm that keeps on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004